Minor-arc and major-arc global surface wave diffraction tomography

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyperbolic Surface-Arc Complements

We show that the fundamental group of a prime alternating surfacearc complement is δ-hyperbolic in case the genus of the surface is greater than zero. AMS Subject classification: 57M25, 57M50, 57M05

متن کامل

Circular Arc Snakes and Kinematic Surface Generation

We discuss the theory, discretization, and numerics of curves which are evolving such that part of their shape, or at least their curvature as a function of arc length, remains unchanged. The discretization of a curve as a smooth sequence of circular arcs is well suited for such purposes, and allows us to reduce evolution of curves to the evolution of a control point collection in a certain fin...

متن کامل

Velocity Inversion with an Iterative Normal Incidence Point (NIP) Wave Tomography with Model-Based Common Diffraction Surface (CDS) Stack

Normal Incidence Point (NIP) wave tomography inversion has been recently developed to generate a velocity model using Common Reflection Surface (CRS) attributes, which is called the kinematic wavefield attribute. In this paper, we propose to use the model based Common Diffraction Surface (CDS) stack method attributes instead of data driven Common Reflection Surface attributes as an input data p...

متن کامل

Arc-Disjoint Cycles and Feedback Arc Sets

Isaak posed the following problem. Suppose T is a tournament having a minimum feedback arc set which induces an acyclic digraph with a hamiltonian path. Is it true that the maximum number of arc-disjoint cycles in T equals the cardinality of minimum feedback arc set of T? We prove that the answer to the problem is in the negative. Further, we study the number of arc-disjoint cycles through a ve...

متن کامل

Arc-Consistency and Arc-Consistency Again

There is no need to show the importance of arc-consistency in Constraint Networks. Mohr and Henderson [8] have proposed AC-4, an algorithm having an optimal worst-case time complexity. But it has two drawbacks: its space complexity and its average time complexity. In problems with many solutions, where the size of the constraints is large, these drawbacks become so important that users often re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics of the Earth and Planetary Interiors

سال: 2005

ISSN: 0031-9201

DOI: 10.1016/j.pepi.2004.10.006